The string-generative capacity of regular dependency languages
نویسندگان
چکیده
This paper contributes to the formal theory of dependency grammar. We apply the classical concept of algebraic recognizability to characterize regular sets of dependency structures, and show how in this framework, two empirically relevant structural restrictions on dependency analyses yield infinite hierarchies of ever more expressive string languages.
منابع مشابه
Deductive Systems and Grammars: Proofs as Grammatical Structures
During the last fifteen years, much of the research of proof theoretical grammars has been focused on their weak generative capacity. This research culminated in Pentus’ theorem, which showed that Lambek grammars generate precisely the context-free languages. However, during the same period of time, research on other grammar formalisms has stressed the importance of “strong generative capacity,...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملHyperedge Replacement and Nonprojective Dependency Structures
Synchronous Hyperedge Replacement Graph Grammars (SHRG) can be used to translate between strings and graphs. In this paper, we study the capacity of these grammars to create non-projective dependency graphs. As an example, we use languages that contain cross serial dependencies. Lexicalized hyperedge replacement grammars can derive string languages (as path graphs) that contain an arbitrary num...
متن کاملDependency Graph-to-String Translation
Compared to tree grammars, graph grammars have stronger generative capacity over structures. Based on an edge replacement grammar, in this paper we propose to use a synchronous graph-to-string grammar for statistical machine translation. The graph we use is directly converted from a dependency tree by labelling edges. We build our translation model in the log-linear framework with standard feat...
متن کاملFeature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کامل